Coalitional unanimity versus strategy-proofness in coalition formation problems

نویسنده

  • Koji Takamiya
چکیده

This paper examines coalition formation problems from the viewpoint of mechanism design. We consider the case where (i) the list of feasible coalitions (those coalitions which are permitted to form) is given in advance; and (ii) each individual’s preference is a ranking over those feasible coalitions which include this individual. We are interested in requiring the mechanism to guarantee each coalition the “right” of forming that coalition at least when every member of the coalition ranks the coalition at the top. We name this property coalitional unanimity. We examine the compatibility between coalitional unanimity and incentive requirements, and prove that if the mechanism is strategy-proof and respects coalitional unanimity, then for each preference profile, there exists at most one strictly core stable partition, and the mechanism chooses such a partition whenever available. Further, the mechanism is coalition strategy-proof and respects coalitional unanimity if, and only if, the strictly core stable partition uniquely exists for every preference profile. JEL Classification— C71, C72, C78, D02, D71, D78. Keywords— coalition formation problems, strict core stability, strategy-proofness, coalitional unanimity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hedonic coalition formation games with variable populations: core characterizations and (im)possibilities

We consider hedonic coalition formation games with variable sets of agents and extend the properties competition sensitivity and resource sensitivity (introduced by Klaus, 2011, for roomate markets) to hedonic coalition formation games. Then, we show that on the domain of solvable hedonic coalition formation games, the Core is characterized by coalitional unanimity and Maskin monotonicity (see ...

متن کامل

Coalitional Manipulations and Generalized Proportional Rules∗

In a unified framework of allocation problems with at least three entities (or agents), we show that “generalized proportional rules” are the only rules that are robust to coalitional manipulations. We characterize proportional rules imposing in addition efficiency, dummy, and nonnegativity. Coalitional manipulations are considered both in the environment without any restriction on coalition fo...

متن کامل

Unimodal Domains, Anti-exchange Properties, and Coalitional Strategy-proofness of Voting Rules

It is shown that simple and coalitional strategy-proofness of a voting rule on the full unimodal domain of a convex idempotent interval space (X, I) are equivalent properties if (X, I) satisfies interval anti-exchange, a basic property also shared by a large class of convex geometries including -but not reducing totrees and linear geometries. Therefore, strategy-proof location problems in a vas...

متن کامل

Coalition-Proofness and Correlation with Arbitrary Communication Possibilities*

The ability of the members of a coalition to communicate secretly determines whether the coalition can coordinate to deviate from a proposed strategy and thus affects which strategies are ‘‘coalition proof.’’ We show that the existence of a Pareto-best element in the set of strategies that survive iterated elimination of dominated strategies implies the existence of a coalition-proof correlated...

متن کامل

Tops Responsiveness, Strategy-proofness and Coalition Formation Problems*

This paper introduces a property over agents’ preferences, called Tops Responsiveness Condition. Such a property guarantees that the core in Hedonic Coalition Formation games is not empty. It is also shown that a mechanism exists that selects a stable allocation. It turns out that this mechanism, to be called tops covering, is strategy-proof even if the core is not a singleton. Furthermore, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2013